Inclusion-exclusion, cancellation, and consecutive sets
نویسندگان
چکیده
The nnnrlnip of inclusion and exclusion and Consecutive Sets M. H. McIlwain )p'n,Clrj·'Yli'·nl of Mathematics Furman University Greenville, SC USA 29613 applied to numerous areas of discrete and combinatorial mathematics. One manifestation of this occurs in probability of the union of events an alternating sum of pn)o(HHjlIW~S of various intersections of events. If the constituent events are themselves Sult1lC:lerltlv well structured, then predictable cancellation occurs in this expansion. We discuss the special case in which each of the underlying sets is "consecutive": namely, its elements are consecutive integers. For such consecutive systems the inclusionexclusion expansion assumes a particularly simple form, in which all reduced codficients in the expression equal ± 1. Moreover, the appropriate sign of each noncancelling term is dictated by the length of a certain path in a graph derived from the incidence structure of the given sets.
منابع مشابه
Counting Problems and the Inclusion-Exclusion Principle
In this paper, we present improved techniques for computing and getting bounds on the cardinality of a union of sets using the inclusion-exclusion principle and Bonferroni inequalities. We organize the terms involved in the inclusionexclusion sum as a tree, showing that a set inclusion between a parent and its children yields a cancellation, where we may prune an entire subtree. Next, we provid...
متن کاملDynamic Pricing with Periodic Review and a Finite set of Prices with Cancellation
In this paper, three dynamic pricing models are developed and analyzed. We assume a limited number of a particular asset is offered for sale over a period of time. This asset is perishable and can be an inventory or a manufacturing capacity. During each period, the seller sets a price for this asset. This price is selected from a predetermined discrete set. The maximum amount which a customer i...
متن کاملContributions to the Theory of Rough Sets
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a pair hL; U i such that L; U are deenable in the information system and L U. In the paper, we introduce a language, called the language of inclusion-exclusion, to describe incomplete speciications of (unknown) sets. W...
متن کاملThe Inclusion-Exclusion Principle for IF-States
Applying two definitions of the union of IF-events, P. Grzegorzewski gave two generalizations of the inclusion-exclusion principle for IF-events.In this paper we prove an inclusion-exclusion principle for IF-states based on a method which can also be used to prove Grzegorzewski's inclusion-exclusion principle for probabilities on IF-events.Finally, we give some applications of this principle by...
متن کاملNumber of Minimal Path Sets in a Consecutive-k-out-of-n: F System
In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 4 شماره
صفحات -
تاریخ انتشار 1991